package com.dyz.leetcode._06_binarySearch;

public class _154_findMin {
    public int findMin(int[] nums) {
        int left = 0;
        int right = nums.length-1;
        while(left<right){
            int mid= left +(right-left)/2;
            if(nums[mid]> nums[right]){
                left = mid+1;
            }else if(nums[mid]==nums[right]){
                right--;
            }else{
                right = mid;
            }
        }
        return nums[left];
    }
}
